Implementation of Extended Systems Using Symbolic Algebra
نویسنده
چکیده
Following the pioneering work of Keller and others in the 1970s and ’80s, numerical techniques for solving non-linear systems of equations that exhibit bifurcations have been developed to the point where they can potentially be applied to a wide range of problems arising in continuum mechanics. The central idea is to augment the discretised governing equations with one or more conditions so that the ‘extended system’ characterises a particular bifurcation point. By computing paths of singular points the behaviour of the system under investigation can be mapped out in a comprehensive fashion. Of considerable practical difficulty when implementing these methods is that they require the evaluation of derivatives of the discretised equations with respect to both the independent variables and the parameters. The higher the codimension of the singularity being sought, the higher the order of the derivatives required. Evaluating these derivatives is both tedious and error prone. An efficient method for computing the necessary derivatives for discretisations based on the Galerkin finiteelement method will be presented that takes advantage of a symbolic algebra package. Our method makes it possible to deal with complicated non-linearities in a very straightforward manner. We demonstrate the complexity of systems that may be addressed by considering Marangoni convection in a two-dimensional domain with a deformable free surface.
منابع مشابه
Computer Algebra Support for the Completed Set of Intervals
Being algebraic completion of the conventional interval arithmetic, the arithmetic on extended (proper and improper) intervals possesses group and other algebraic properties suitable for implementation in computer algebra systems. We give an overview of a Mathematica package directed.m supporting the completed set of intervals and discuss the bene ts, provided by this package, for doing numeric...
متن کاملExtended Fuzzy $BCK$-subalgebras
This paper extends the notion of fuzzy $BCK$-subalgebras to fuzzy hyper $BCK$-subalgebras and defines an extended fuzzy $BCK$-subalgebras. This study considers a type of fuzzy hyper $BCK$-ideals in this hyperstructure and describes the relationship between hyper $BCK$-ideals and fuzzy hyper $BCK$-ideals. In fact, it tries to introduce a strongly regular relation on hyper $...
متن کاملA Generalized Symbolic Thomas Algorithm
The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. Some illustrative examples are given.
متن کاملInterfaces to symbolic computation systems: reconsidering experience of Bergman
The article is based on experience of implementation of computer algebra system Bergman and on analysis of other symbolic computation systems. It is noted that many symbolic computation systems meet similar interface problems. Necessity of strict separation of calculation engine and interface shell, functions of these components, and requirements to them are motivated. The described approach wi...
متن کاملWorkshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005) Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005)
This paper introduces a method for formal and symbolic analysis of single–input single–output continuous–time control systems. The method is based on traditional control engineering analysis using Nichols plots and thus focuses on the properties of gain (amplitude) and phase–shift. We reduce Nichols plot requirements to a decision problem and present a procedure to decide problems of this type....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000